Section: New Software and Platforms

BaPCod

A generic Branch-And-Price-And-Cut Code

Keywords: Column Generation - Branch-and-Price - Branch-and-Cut - Mixed Integer Programming - Mathematical Optimization - Benders Decomposition - Dantzig-Wolfe Decomposition - Extended Formulation

Functional Description: BaPCod is a prototype code that solves Mixed Integer Programs (MIP) by application of reformulation and decomposition techniques. The reformulated problem is solved using a branch-and-price-and-cut (column generation) algorithms, Benders approaches, network flow and dynamic programming algorithms. These methods can be combined in several hybrid algorithms to produce exact or approximate solutions (primal solutions with a bound on the deviation to the optimum).

Release Functional Description: An important update to make BaPCod compatible with VRPSolver. Correction of numerous bugs.

• Participants: Artur Alves Pessoa, Boris Detienne, Eduardo Uchoa Barboza, Franck Labat, François Clautiaux, Francois Vanderbeck, Halil Sen, Issam Tahiri, Michael Poss, Pierre Pesneau, Romain Leguay and Ruslan Sadykov

• Partners: Université de Bordeaux - CNRS - IPB - Universidade Federal Fluminense

• Contact: Ruslan Sadykov

• URL: https://wiki.bordeaux.inria.fr/realopt/pmwiki.php/Project/BaPCod